On the Design of Deterministic Matrices for Fast Recovery of Fourier Compressible Functions
نویسندگان
چکیده
We present a general class of compressed sensing matrices which are then demonstrated to have associated sublinear-time sparse approximation algorithms. We then develop methods for constructing specialized matrices from this class which are sparse when multiplied with a discrete Fourier transform matrix. Ultimately, these considerations improve previous sampling requirements for deterministic sparse Fourier transform methods.
منابع مشابه
Numerical solution of general nonlinear Fredholm-Volterra integral equations using Chebyshev approximation
A numerical method for solving nonlinear Fredholm-Volterra integral equations of general type is presented. This method is based on replacement of unknown function by truncated series of well known Chebyshev expansion of functions. The quadrature formulas which we use to calculate integral terms have been imated by Fast Fourier Transform (FFT). This is a grate advantage of this method which has...
متن کاملDeterministic construction of Fourier-based compressed sensing matrices using an almost difference set
In this paper, a new class of Fourier-based matrices is studied for deterministic compressed sensing. Initially, a basic partial Fourier matrix is introduced by choosing the rows deterministically from the inverse discrete Fourier transform (DFT) matrix. By row/column rearrangement, the matrix is represented as a concatenation of DFT-based submatrices. Then, a full or a part of columns of the c...
متن کاملFinding Significant Fourier Transform Coefficients Deterministically and Locally
Computing the Fourier transform is a basic building block used in numerous applications. For data intensive applications, even the O(N logN) running time of the Fast Fourier Transform (FFT) algorithm may be too slow, and sub-linear running time is necessary. Clearly, outputting the entire Fourier transform in sub-linear time is infeasible, nevertheless, in many applications it suffices to find ...
متن کاملDeterministic Sparse Fourier Approximation via Fooling Arithmetic Progressions
A significant Fourier transform (SFT) algorithm, given a threshold τ and oracle access to a function f , outputs (the frequencies and approximate values of) all the τ -significant Fourier coefficients of f , i.e., the Fourier coefficients whose magnitude exceeds τ‖f‖2. In this paper we present the first deterministic SFT algorithm for functions f over ZN which is: (1) Local, i.e., its running t...
متن کاملSparse FFT for Functions with Short Frequency Support
In this paper we derive a deterministic fast discrete Fourier transform algorithm for a 2π-periodic function f whose Fourier coefficients with significantly large magnitude are contained inside a support interval of length B. The algorithm is based on a method for the efficient recovery of B-sparse 2π-periodic functions presented by Iwen in [15]. If a good bound B on the support length is known...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Matrix Analysis Applications
دوره 33 شماره
صفحات -
تاریخ انتشار 2012